Intuitionistic Propositional Calculus in the Extended Framework with Modal Operator. Part I
نویسنده
چکیده
In this paper, we develop intuitionistic propositional calculus IPC in the extended language with single modal operator. The formulation that we adopt in this paper is very useful not only to formalize the calculus but also to do a number of logics with essentially propositional character. In addition, it is much simpler than the past formalization for modal logic. In the first section, we give the mentioned formulation which the author heavily owes to the formalism of Adam Grabowski’s [4]. After the theoretical development of the logic, we prove a number of valid formulas of IPC in the sections 2–4. The last two sections are devoted to present classical propositional calculus and modal calculus S4 in our framework, as a preparation for future study. In the forthcoming Part II of this paper, we shall prove, among others, a number of intuitionistically valid formulas with negation.
منابع مشابه
Models for Normal Intuitionistic Modal Logics
Kripke-style models with two accessibility relations, one intuitionistio and the other modal, are given for analogues of the modal system K based on Heyting's propositional logic. I t is shown that these two relations can combine with each other in various ways. Soundness and completeness are proved for systems with only the necessity operator, or only the possibility operator, or both. Embeddi...
متن کاملA modal logic amalgam of classical and intuitionistic propositional logic
We present a modal extension of classical propositional logic in which intuitionistic propositional logic is mirrored by means of the modal operator. In this sense, the modal extension combines classical and intuitionistic propositional logic avoiding the collapsing problem. Adopting ideas from a recent paper (S. Lewitzka, A denotational semantics for a Lewis-style modal system close to S1, 201...
متن کاملExtended Abstract: Reconsidering Intuitionistic Duality
This paper proposes a new syntax and proof system called Dualized Intuitionistic Logic (DIL), for intuitionistic propositional logic with the subtraction operator. Our goal is a conservative extension of standard propositional intuitionistic logic with perfect duality (symmetry) between positive and negative connectives. The proof system should satisfy the following metatheoretic properties: so...
متن کاملA Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy
In 1933, Gödel [9] proposed a translation τ of intuitionistic propositional formulas into a modal language. Formula τ(F ) is obtained from formula F by placing the modality 2 in front of each subformula of formula F . He proved that if F is a theorem in intuitionistic propositional calculus IPL [12], then τ(F ) is provable in modal logic S4. The converse of this statement was later shown by McK...
متن کاملThe Subvariety of Q-heyting Algebras Generated by Chains
The variety QH of Heyting algebras with a quantifier [14] corresponds to the algebraic study of the modal intuitionistic propositional calculus without the necessity operator. This paper is concerned with the subvariety C of QH generated by chains. We prove that this subvariety is characterized within QH by the equations ∇(x∧ y) ≈ ∇x∧∇y and (x → y)∨ (y → x) ≈ 1. We investigate free objects in C.
متن کامل